Parking on transitive unimodular graphs
نویسندگان
چکیده
منابع مشابه
Dynamics on Unimodular Random Graphs
This paper is centered on covariant dynamics on random graphs and random networks (marked graphs), which can be described as rules to navigate the vertices that are preserved by graph/network isomorphisms. Such dynamics are referred to as vertex-shifts here. Unimodular random networks can be heuristically described as networks seen from a vertex chosen uniformly at random, both in the finite an...
متن کاملOn Distance-transitive Graphs
Cameron's proof of this result is based on Sims' Conjecture, which has only been shown to hold using the classification of finite simple groups. In the final section of [1], Cameron indicates how Theorem 1 might be proved in an elementary fashion using Macpherson's classification of infinite distance-transitive graphs of finite valency [4]. Corollary 1 below provides the missing portion of this...
متن کاملOn the eigenvalues of normal edge-transitive Cayley graphs
A graph $Gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $Gamma$ acts transitively on $V(Gamma)$ or $E(Gamma)$, respectively. Let $Gamma=Cay(G,S)$ be a Cayley graph on $G$ relative to $S$. Then, $Gamma$ is said to be normal edge-transitive, if $N_{Aut(Gamma)}(G)$ acts transitively on edges. In this paper, the eigenvalues of normal edge-tra...
متن کاملTransitive cycle factorizations and prime parking functions
Minimal transitive cycle factorizations and parking functions are related very closely. Using the correspondence between them, we find a bijection between minimal transitive factorizations of permutations of type (1, n − 1) and prime parking functions of length n.
متن کاملPerfect Matchings in Edge-Transitive Graphs
We find recursive formulae for the number of perfect matchings in a graph G by splitting G into subgraphs H and Q. We use these formulas to count perfect matching of P hypercube Qn. We also apply our formulas to prove that the number of perfect matching in an edge-transitive graph is , where denotes the number of perfect matchings in G, is the graph constructed from by deleting edges with an en...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Applied Probability
سال: 2019
ISSN: 1050-5164
DOI: 10.1214/18-aap1443